Operational semantics of logical concurrent systems
نویسنده
چکیده
We describe the operational semantics of the language for modelling logical concurrent systems (LCS). Such systems are characterised by atomic synchronous uniication. The model permits the description of both dependant and independent simultaneous actions or sets of atomic events. A semantics is given via labelled transition systems. The notion of equivalence over such systems is deened by strong bisimulation. Also, the notion of answer semantics is deened via LTS. Some toy-example of systems are described.
منابع مشابه
Silcs { Speciication in Logic of Concurrent Systems
This paper introduces the constructive logic speciication language SILCS (Speciication In Logic of Concurrent Systems). The operational semantics of SILCS encapsulates the computational rule required for the correct interpretation of`programs' derived from Horn clause characterisations of the behaviour of concurrent systems. SILCS is expressive enough to describe many of the behaviours associat...
متن کاملLogical Specification of Operational Semantics
Various logic-based frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts, rewriting logic, and tile logic. We consider the relationship between these frameworks, and assess ...
متن کاملLinear Concurrent Constraint Programming: Operational and Phase Semantics
In this paper we settle a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the us...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملA Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
This paper presents a typed higher-order concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that a higherorder variant of the traces model is fully abstract for maytesting. This proof uses a program logic based on Hennessy– Milner logic and Abramsky’s domain theory in logical...
متن کامل